L p compression , traveling salesmen , and stable walks
نویسندگان
چکیده
We show that if H is a group of polynomial growth whose growth rate is at least quadratic then the Lp compression of the wreath product Z oH equals max { 1 p , 1 2 } . We also show that the Lp compression of Z oZ equals max { p 2p−1 , 2 3 } and the Lp compression of (Z oZ)0 (the zero section of Z oZ, equipped with the metric induced from Z o Z) equals max { p+1 2p , 3 4 } . The fact that the Hilbert compression exponent of Z o Z equals 3 while the Hilbert compression exponent of (Z o Z)0 equals 3 4 is used to show that there exists a Lipschitz function f : (Z o Z)0 → L2 which cannot be extended to a Lipschitz function defined on all of Z o Z.
منابع مشابه
An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کاملAn ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems
The fixed destination multi-depot multiple traveling salesmen problem (MmTSP) is a problem, in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman, and the tour lengths stay within certain limits. This problem is of a great complexity and few investigations have been done on ...
متن کاملLearning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks
While there are optimal TSP solvers as well as recent learning-based approaches, the generalization of the TSP to the multiple Traveling Salesmen Problem is much less studied. Here, we design a neural network solution that treats the salesmen, the cities, and the depot as three different sets of varying cardinalities. Coupled with a normalization algorithm, a dedicated loss, and a search method...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملGeneralized multiple depot traveling salesmen problem - Polyhedral study and exact algorithm
The generalized multiple depot traveling salesmen problem (GMDTSP) is a variant of the multiple depot traveling salesmen problem (MDTSP), where each salesman starts at a distinct depot, the targets are partitioned into clusters and at least one target in each cluster is visited by some salesman. The GMDTSP is an NP-hard problem as it generalizes the MDTSP and has practical applications in desig...
متن کامل